Geometric programs treated with slack variables
نویسندگان
چکیده
Kochenberger and Woolsley have introduced slack variables into the constraints of a geometric program and have added their reciprocals to the objective function. They find this augmented program advantageous for numerical minimization^ In this paper the augmented program is used to give a relatively simple proof of the "refined duality theory of geometric programming. This proof also shows that the optimal solutions for the augmented program converge to the (desired) optimal solutions for the original program. This work was supported by Grant DA-AROD-31-124-71-817^ Army Research Office, Durham. Carnegie-Mellon University Northwestern University HIM LIBRARY ftWBIE-MELUMI M
منابع مشابه
Branching Programs with Variables, and Implications for Time-Space Tradeoffs
We introduce branching programs augmented with the ability to write to and read from variables other than the inputs. This is a substantial strengthening of the model. We show, however, that Ajtai’s size lower bounds for linear-time multi-way branching programs solving a Hamming distance problem [Ajt99a] carry over to the stronger model. This indicates an obstacle to extending this and related ...
متن کاملOne Class Classification for Anomaly Detection: Support Vector Data Description Revisited
The Support Vector Data Description (SVDD) has been introduced to address the problem of anomaly (or outlier) detection. It essentially fits the smallest possible sphere around the given data points, allowing some points to be excluded as outliers. Whether or not a point is excluded, is governed by a slack variable. Mathematically, the values for the slack variables are obtained by minimizing a...
متن کاملReversed geometric programs treated by harmonic means
A "posynomial" is a (generalized) polynomial with arbitrary real exponents, but positive coefficients and positive independent variables. Each posynomial program in which a posynomial is to be minimized subject to only inequality posynomial constraints is termed a "reversed geometric program". The study of each reversed geometric program is reduced to the study of a corresponding family of appr...
متن کاملSemidefinite Programs with Interval Uncertainty: Reduced Vertex Results
In this paper, we derive a reduced vertex result for robust solution of uncertain semidefinite optimization problems subject to interval uncertainty. If the number of decision variables is m and the size of the coefficient matrices in the linear matrix inequality constraints is n×n, a direct vertex approach would require satisfaction of 2 vertex constraints: a huge number, even for small values...
متن کاملOptimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
In this work we are interested in nonlinear symmetric cone problems (NSCPs), which contain as special cases nonlinear semidefinite programming, nonlinear second order cone programming and the classical nonlinear programming problems. We explore the possibility of reformulating NSCPs as common nonlinear programs (NLPs), with the aid of squared slack variables. Through this connection, we show ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015